Channel estimation for time division duplex communication systems

ABSTRACT

A single transmitter transmits K communication bursts in a shared spectrum in a time slot of a time division duplex communication system. The system associated with N midamble sequences. Each burst has an associated midamble sequence. A receiver receives a vector corresponding to the transmitted midamble sequences of the K communication bursts. A matrix having N identical right circulant matrix blocks is constructed based in part on the known N midamble sequences. The wireless channel between the transmitter and receiver is estimated based on in part one of the N blocks and the received vector.

[0001] This application claims priority to U.S. Provisional Patent Application No. 60/175,167, filed on Jan. 7, 2000.

BACKGROUND

[0002] The invention generally relates to wireless communication systems. In particular, the invention relates to channel estimation in a wireless communication system.

[0003]FIG. 1 is an illustration of a wireless communication system 10. The communication system 10 has base stations 12 ₁ to 12 ₅ which communicate with user equipments (UEs) 14 ₁ to 14 ₃. Each base station 12 ₁ has an associated operational area where it communicates with UEs 14 ₁ to 14 ₃ in its operational area.

[0004] In some communication systems, such as code division multiple access (CDMA) and time division duplex using code division multiple access (TDD/CDMA), multiple communications are sent over the same frequency spectrum. These communications are typically differentiated by their chip code sequences. To more efficiently use the frequency spectrum, TDD/CDMA communication systems use repeating frames divided into time slots for communication. A communication sent in such a system will have one or multiple associated chip codes and time slots assigned to it based on the communication's bandwidth.

[0005] Since multiple communications may be sent in the same frequency spectrum and at the same time, a receiver in such a system must distinguish between the multiple communications. One approach to detecting such signals is single user detection. In single user detection, a receiver detects only the communications from a desired transmitter using a code associated with the desired transmitter, and treats signals of other transmitters as interference. Another approach is referred to as joint detection. In joint detection, multiple communications are detected simultaneously.

[0006] To utilize these detection techniques, it is desirable to have an estimation of the wireless channel in which each communication travels. In a typical TDD system, the channel estimation is performed using midamble sequences in communication bursts.

[0007] A typical communication burst 16 has a midamble 20, a guard period 18 and two data bursts 22, 24, as shown in FIG. 2. The midamble 20 separates the two data bursts 22, 24 and the guard period 18 separates the communication bursts 16 to allow for the difference in arrival times of bursts 16 transmitted from different transmitters. The two data bursts 22, 24 contain the communication burst's data. The midamble 20 contains a training sequence for use in channel estimation.

[0008] After a receiver receives a communication burst 16, it estimates the channel using the received midamble sequence. When a receiver receives multiple bursts 16 in a time slot, it typically estimates the channel for each burst 16. One approach for such channel estimation for communication bursts 16 sent through multiple channels is a Steiner Channel Estimator. Steiner Channel Estimation is typically used for uplink communications from multiple UEs, 14 ₁ to 14 ₃, where the channel estimator needs to estimate multiple channels.

[0009] In some situations, multiple bursts 16 experience the same wireless channel. One case is a high data rate service, such as a 2 megabits per second (Mbps) service. In such a system, a transmitter may transmit multiple bursts in a single time slot. Steiner estimation can be applied in such a case by averaging the estimated channel responses from all the bursts 16. However, this approach has a high complexity. Accordingly, it is desirable to have alternate approaches to channel estimation.

SUMMARY

[0010] A single transmitter transmits K communication bursts in a shared spectrum in a time slot of a time division duplex communication system. The system associated with N midamble sequences. Each burst has an associated midamble sequence. A receiver receives a vector corresponding to the transmitted midamble sequences of the K communication bursts. A matrix having N identical right circulant matrix blocks is constructed based in part on the known N midamble sequences. The wireless channel between the transmitter and receiver is estimated based on in part one of the N blocks and the received vector.

BRIEF DESCRIPTION OF THE DRAWING(S)

[0011]FIG. 1 is a wireless communication system.

[0012]FIG. 2 is an illustration of a communication burst.

[0013]FIG. 3 is a simplified multiburst transmitter and receiver.

[0014]FIG. 4 is a flow chart of multiburst channel estimation.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

[0015]FIG. 3 illustrates a simplified multicode transmitter 26 and receiver 28 in a TDD/CDMA communication system. In a preferred application, such as a 2 Mbs downlink service, the receiver 28 is in a UE 14 ₁ and the transmitter 26 is in a base station 12 ₁, although the receiver 28 and transmitter 26 may be used in other applications.

[0016] The transmitter 26 sends data over a wireless radio channel 30. The data is sent in K communication bursts. Data generators 32 ₁ to 32 _(K) in the transmitter 26 generate data to be communicated to the receiver 28. Modulation/spreading and training sequence insertion devices 34 ₁ to 34 _(K) spread the data and make the spread reference data time-multiplexed with a midamble training sequence in the appropriate assigned time slot and codes for spreading the data, producing the K communication bursts. Typical values of K for a base station 12 ₁ transmitting downlink bursts are from 1 to 16. The communication bursts are combined by a combiner 48 and modulated by a modulator 36 to radio frequency (RF). An antenna 38 radiates the RF signal through the wireless radio channel 30 to an antenna 40 of the receiver 28. The type of modulation used for the transmitted communication can be any of those known to those skilled in the art, such as binary phase shift keying (BPSK) or quadrature phase shift keying (QPSK).

[0017] The antenna 40 of the receiver 28 receives various radio frequency signals. The received signals are demodulated by a demodulator 42 to produce a baseband signal. The baseband signal is processed, such as by a channel estimation device 44 and a data detection device 46, in the time slot and with the appropriate codes assigned to the transmitted communication bursts. The data detection device 46 may be a multiuser detector or a single user detector. The channel estimation device 44 uses the midamble training sequence component in the baseband signal to provide channel information, such as channel impulse responses. The channel information is used by the data detection device 46 to estimate the transmitted data of the received communication bursts as hard symbols.

[0018] To illustrate one implementation of multiburst channel estimation, the following midamble type is used, although multiburst channel estimation is applicable to other midamble types. The K midamble codes, m^((k)) , where k=1 . . . K, are derived as time shifted versions of a periodic single basic midamble code, m_(P) , of period P chips. The length of each midamble code is L_(m)=P+W−1. W is the length of the user channel impulse response. Typical values for L_(m) are 256 and 512 chips. W is the length of the user channel impulse response. Although the following discussion is based on each burst having a different midamble code, some midambles may have the same code. As, a result, the analysis is based on N midamble codes, N<K. Additionally, the system may have a maximum number of acceptable midamble codes N. The receiver 28 in such a system may estimate the channel for the N maximum number of codes, even if less than N codes are transmitted.

[0019] The elements of m_(P) take values from the integer set {1, −1}. The sequence m_(P) is first converted to a complex sequence {tilde over (m)} _(P)[i]=j^(i)·m_(P) [i], where i=1 . . . P. The m^((k)) are obtained by picking K sub-sequences of length L_(m) from a 2 P long sequence formed by concatenating two periods of {tilde over (m)} _(P). The i^(th) element of m^((k)) is related to {tilde over (m)} _(P) by Equation 1. $\begin{matrix} \begin{matrix} {{\underset{\_}{m_{i}^{(k)}} = {{\overset{\sim}{m}}_{P}\left\lbrack {{\left( {K - k} \right)W} + i} \right\rbrack}},} & {{{for}\quad 1} \leq i \leq {P - {\left( {K - k} \right)W}}} \\ {{= {{\overset{\sim}{m}}_{P}\left\lbrack {i - P + {\left( {K - k} \right)W}} \right\rbrack}},} & {{{{for}\quad P} - {\left( {K - k} \right)W}} \leq i \leq {P + W - 1}} \end{matrix} & \text{Equation~~1} \end{matrix}$

[0020] Thus, the starting point of m^((k)) ,k=1 . . . K shifts to the right by W chips as k increases from 1 to K.

[0021] The combined received midamble sequences are a superposition of the K convolutions. The k^(th) convolution represents the convolution of m^((k)) with {overscore (h^((k)))}·{overscore (h^((k)))} is the channel response of the k^(th) user. The preceding data field in the burst corrupts the first (W−1) chips of the received midamble. Hence, for the purpose of channel estimation, only the last P of L_(m) chips are used to estimate the channel.

[0022] Multiburst channel estimation will be explained in conjunction with the flow chart of FIG. 4. To solve for the individual channel responses {overscore (h^((k)))}, Equation 2 is used. $\begin{matrix} {{\left\lbrack {\begin{matrix} m_{P} & \cdots & m_{{{({K - 1})}W} + 1} \\ m_{1} & \cdots & m_{{{({K - 1})}W} + 2} \\ m_{2} & \cdots & m_{{{({K - 1})}W} + 3} \\ \vdots & \vdots & \vdots \\ m_{{KW} - 1} & \vdots & m_{{({K - 1})}W} \end{matrix}{\begin{matrix} m_{{({K - 1})}W} & \cdots & m_{{{({K - 2})}W} + 1} \\ m_{{{({K - 1})}W} + 1} & \cdots & m_{{{({K - 2})}W} + 2} \\ m_{{{({K - 1})}W} + 2} & \cdots & m_{{{({K - 2})}W} + 3} \\ \vdots & \vdots & \vdots \\ m_{{{({K - 1})}W} - 1} & \cdots & m_{{({K - 2})}W} \end{matrix}{\ldots \begin{matrix} m_{W} & \cdots & m_{1} \\ m_{W + 1} & \cdots & m_{2} \\ m_{W + 2} & \cdots & m_{3} \\ \vdots & \vdots & \vdots \\ m_{W - 1} & \quad & m_{P} \end{matrix}}}} \right\rbrack \times \begin{bmatrix} {\underset{-}{h}}^{(1)} \\ {\underset{-}{h}}^{(2)} \\ \vdots \\ {\underset{-}{h}}^{(K)} \end{bmatrix}} = \begin{bmatrix} r_{W} \\ r_{W + 1} \\ r_{W + 2} \\ \vdots \\ r_{L_{m}} \end{bmatrix}} & \text{Equation~~2} \end{matrix}$

[0023] r_(W) . . . r_(LM) are the received combined chips of the midamble sequences. The m values are the elements of m_(P) .

[0024] Equation 2 may also be rewritten in shorthand as Equation 3. $\begin{matrix} {{\sum\limits_{k - 1}^{K}{M^{(k)}\overset{\_}{h^{(k)}}}} = \overset{\_}{r}} & \text{Equation~~3} \end{matrix}$

[0025] Each M^((k)) is a KW-by-W matrix. {overscore (r)} is the received midamble chip responses. When all the bursts travel through the same channel, {overscore (h⁽¹⁾)} . . . {overscore (h^((k)))} can be replaced by {overscore (h)} as in Equation 4, 50. $\begin{matrix} {{\left\lbrack {\sum\limits_{k = 1}^{K}M^{(k)}} \right\rbrack \quad \overset{\_}{h}} = \overset{\_}{r}} & \text{Equation~~4} \end{matrix}$

[0026] G is defined as per Equation 5.

[0027] $\begin{matrix} {G = \left\lbrack {M^{(1)},\quad \ldots \quad,M^{(k)},\quad \ldots \quad,M^{(k)}} \right\rbrack} & {{Equation}\quad 5} \end{matrix}$

[0028] As a result, G is a KW-by-KW matrix. Since G is a right circulant matrix, Equation 4 can be rewritten using K identical right circulant matrix blocks B, as per Equation 6, 52. $\begin{matrix} {\left\lbrack {\sum\limits_{k = 1}^{K}M^{(k)}} \right\rbrack = {\begin{bmatrix} B \\ B \\ \vdots \\ B \end{bmatrix} = D}} & \text{Equation~~6} \end{matrix}$

[0029] B is a W-by-W right circulant matrix. The number of B-blocks is K. Using Equation 6, Equation 4 can be rewritten as Equation 7.

D{overscore (h)}={overscore (r)}  Equation 7

[0030] Equation 7 describes an over-determined system with dimensions KW-by-W. One approach to solve Equation 7 is a least squares solution, 54. The least squares solution of Equation 7 is given by Equation 8.

{overscore (ĥ)}=(D ^(H) D)⁻¹ D ^(H) {overscore (r)}  Equation 8

[0031] D^(H) is the hermitian of D.

[0032] Applying Equation 6 to Equation 8 results in Equation 9. $\begin{matrix} {\left( {D^{H}D} \right)^{- 1} = {\frac{1}{K}\left( {B^{H}B} \right)^{- 1}}} & \text{Equation 9} \end{matrix}$

[0033] The received vector {overscore (r)} of dimension KW can be decomposed as per Equation 10. $\begin{matrix} {\overset{\_}{r} = \begin{bmatrix} \overset{\_}{r_{1}} \\ \overset{\_}{r_{2}} \\ \vdots \\ \overset{\_}{r_{k}} \end{bmatrix}} & \text{Equation~~10} \end{matrix}$

[0034] The dimension of {overscore (r_(k))} is W. Substituting Equations 9 and 10 into Equation 8, the least-squares solution for the channel coefficients per Equation 11 results. $\begin{matrix} {\overset{\hat{\_}}{h} = {{\left( {B^{H}B} \right)^{- 1}{B^{H}\left( {\frac{1}{K}{\sum\limits_{k = 1}^{K}\overset{\_}{r_{k}}}} \right)}} = {\left( {B^{H}B} \right)^{- 1}B^{H}\overset{\overset{\_}{\_}}{r_{k}}}}} & \text{Equation~~11} \end{matrix}$

[0035] {double overscore (r_(k))} represents the average of the segments of {overscore (r)}. Since B is a square matrix, Equation 11 Equation 12.

{overscore (ĥ)}=B ⁻¹ {double overscore (r_(k))}  Equation 12

[0036] Since B is a right circulant matrix and the inverse of a right circulant matrix is also right circulant, the channel estimator can be implemented by a single cyclic correlator of dimension 57, or by a discrete fourier transform (DFT) solution.

[0037] A W point DFT method is as follows. Since B is right circulant, Equation 13 can be used.

B=D _(W) ⁻¹·Λ_(C) ·D _(W)  Equation 13

[0038] D_(W) is the W point DFT matrix as per Equation 14. $\begin{matrix} {D_{W} = \begin{bmatrix} {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{0} & \cdots & {\overset{\sim}{W}}^{0} \\ {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{1} & {\overset{\sim}{W}}^{2} & {\overset{\sim}{W}}^{3} & \cdots & {\overset{\sim}{W}}^{({W - 1})} \\ {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{2} & {\overset{\sim}{W}}^{4} & {\overset{\sim}{W}}^{6} & \cdots & {\overset{\sim}{W}}^{2{({W - 1})}} \\ {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{3} & {\overset{\sim}{W}}^{6} & {\overset{\sim}{W}}^{9} & \cdots & {\overset{\sim}{W}}^{3{({W - 1})}} \\ \vdots & \vdots & \vdots & \vdots & \cdots & \vdots \\ {\overset{\sim}{W}}^{0} & {\overset{\sim}{W}}^{({W - 1})} & {\overset{\sim}{W}}^{2{({W - 1})}} & {\overset{\sim}{W}}^{3{({W - 1})}} & \cdots & {\overset{\sim}{W}}^{{({W - 1})}\quad {({W - 1})}} \end{bmatrix}} & \text{Equation~~14} \end{matrix}$

[0039] Λ_(C) is a diagonal matrix whose main diagonal is the DFT of the first column of B, as per Equation 15.

Λ_(C)=diag(D _(W)(B(:,1)))  Equation 15

[0040] $\overset{\sim}{W} = {^{{- j}\quad \frac{2\pi}{W}}.}$

[0041] Thus, D_(W) is the DFT operator so that D_(W) x represents the W point DFT of the vector x. By substituting Equation 13 into Equation 12 and using ${D_{W}^{- 1} = \frac{D_{W}^{*}}{W}},$

[0042] results in Equation 16. $\begin{matrix} {\overset{\_}{h} = {\left( {D_{W}^{*} \cdot \frac{1}{W} \cdot \Lambda_{C}^{- 1} \cdot D_{W}} \right)\overset{\_}{r}}} & \text{Equation~~16} \end{matrix}$

[0043] D_(W)* is the element-by-element complex conjugate of D_(W).

[0044] Alternately, an equivalent form that expresses {overscore (h)} in terms of Λ_(R) instead of Λ_(C) can be derived. Λ_(R) is a diagonal matrix whose main diagonal is the DFT of the first row of B per Equation 17.

Λ_(R)=diag(D _(W)(B(1,:)))  Equation 17

[0045] Since the transpose of B, B^(T), is also right circulant and that its first column is the first row of B, B^(T) can be expressed by Equation 18.

B ^(T) =D _(W) ⁻¹·Λ_(R) ·D _(W)  Equation 18

[0046] Using Equation 18 and that D_(W) ^(T)=D_(W), Λ^(T) _(R)=Λ_(R) and that for any invertible matrix A, (A^(T)) ⁻¹ =(A⁻¹) ^(T) , B can be expressed as per Equation 19.

B=D _(W)·Λ_(R) ·D _(W) ⁻¹  Equation 19

[0047] Substituting Equation 19 into Equation 12 and that $D_{W}^{- 1} = \frac{D_{W}^{*}}{W}$

[0048] results in Equation 20. $\begin{matrix} {\overset{\_}{h} = {\left( {{D_{W} \cdot \Lambda_{R}^{- 1} \cdot \frac{1}{W}}D_{W}^{*}} \right)\quad \overset{\_}{r}}} & \text{Equation~~20} \end{matrix}$

[0049] Equations 16 or 20 can be used to solve for {overscore (h)}. Since all DFTs are of length W, the complexity in solving the equations is dramatically reduced.

[0050] An approach using a single cycle correlator is as follows. Since B⁻¹ is the inverse of a right circulant matrix, it can be written as Equation 21. $\begin{matrix} {B^{- 1} = {T = \begin{bmatrix} T_{1} & T_{P} & \cdots & T_{3} & T_{2} \\ T_{2} & T_{1} & \cdots & T_{4} & T_{3} \\ \vdots & \vdots & \cdots & \vdots & \vdots \\ T_{W - 1} & T_{W - 2} & \cdots & T_{1} & T_{W} \\ T_{W} & T_{W - 1} & \cdots & T_{2} & T_{1} \end{bmatrix}}} & \text{Equation~~21} \end{matrix}$

[0051] The first row of the matrix T is equal to the inverse DFT of the main diagonal of Λ_(R) ⁻¹. Thus, the matrix T is completely determined by Λ_(R) ⁻¹.

[0052] The taps of the channel response {overscore (h)} are obtained successively by an inner product of successive rows of T with the average of W-length segments of the received vector {overscore (r)}. The successive rows of T are circularly right shifted versions of the previous row. Using registers to generate the inner product, the first register holds the averaged segments of {overscore (r)}, and the second register is a shift register that holds the first row of the matrix T. The second register is circularly shifted at a certain clock rate. At each cycle of the clock, a new element of {overscore (h)} is determined by the inner product of the vectors stored in the two registers. It is advantageous to shift the first row of the matrix T rather than the received midambles. As a result, no extra storage is required for the midambles. The midambles continue to reside in the received buffer that holds the entire burst. Since the correlator length is only W, a significant reduction in complexity of estimating the channel is achieved. 

What is claimed is:
 1. A method for estimating a wireless channel in a time division duplex communication system using code division multiple access, the system associated with N midamble sequences, the wireless channel existing between a single transmitter and a single receiver, the single transmitter transmitting K communication bursts in a shared spectrum in a time slot, each burst having an associated midamble sequence of the N sequences, the receiving knowing the N midamble sequences, the method comprising: receiving a vector corresponding to the transmitted midamble sequences of the K communication bursts at the single receiver; constructing a matrix having N identical right circulant matrix blocks based in part on the known N midamble sequences; and estimating the wireless channel based on in part one of the N blocks and the received vector.
 2. The method of claim 1 wherein the wireless channel estimating is performed using a least squares solution.
 3. The method of claim 2 wherein the least squares solution is implemented using a single cyclic correlator.
 4. The method of claim 2 wherein the least squares solution is implemented using a discrete fourier transform solution.
 5. The method of claim 1 wherein N is a maximum number of midamble codes associated with the system.
 6. The method of claim 1 wherein N is a number of different midambles transmitted in the K bursts.
 7. The method of claim 1 wherein a dimension of the estimation is a length of a channel response of the wireless channel.
 8. A receiver for use in a wireless time division duplex communication system using code division multiple access, the system associated with N midamble sequences, a single transmitter in the system transmits K communication bursts in a shared spectrum in a time slot, each burst having an associated midamble sequence of the N sequences, the receiver knowing the N midamble sequences, the receiver comprising: an antenna for receiving the K communication bursts including a vector corresponding to the transmitted midamble sequences of the bursts; a channel estimator for constructing a matrix having N identical right circulant-matrix blocks based in part on the known N midamble sequences and estimating the wireless channel between the receiver and the single transmitter based on in part one of the N blocks and the received vector; and a data detector for recovery data from the received communication bursts using the estimated wireless channel.
 9. The receiver of claim 8 wherein the data detector is a multiuser detector.
 10. The receiver of claim 8 wherein the data detector is a single user detector.
 11. The receiver of claim 8 wherein the wireless channel estimating is performed using a least squares solution.
 12. The receiver of claim 11 wherein the least squares solution is implemented using a discrete fourier transform solution.
 13. The receiver of claim 11 wherein the least squares solution is implemented using a single cyclic correlator.
 14. A wireless spread spectrum communication system using code division multiple access associated with N midamble sequences, the system communicating using communication bursts, each burst having an associated midamble sequence, the system comprising: a base station comprising: a data generator for generating data; a plurality of modulation/spreading devices for formatting the generated data into K communication bursts time multiplexed to be in a same time slot and in a shared spectrum; and an antenna for radiating the K communication bursts; and a user equipment comprising: an antenna for receiving the K communication bursts including a vector corresponding to the transmitted midamble sequences of the bursts; a channel estimator for constructing a matrix having N identical right circulant matrix blocks based in part on the N midamble sequences and estimating the wireless channel between the base station and the user equipment based on in part the K block matrix and the received vector; and a data detector for recovering data from the received communication bursts using the estimated wireless channel.
 15. The system of claim 14 wherein the data detector is a multiuser detector.
 16. The system of claim 14 wherein the data detector is a plurality of single user detectors.
 17. The system of claim 14 wherein the wireless channel estimating is performed using a least squares solution.
 18. The system of claim 17 wherein the least squares solution is implemented using a discrete fourier transform solution.
 19. The system of claim 17 wherein the least squares solution is implemented using a single cyclic correlator.
 20. The system of claim 14 wherein the base station is effectively transmitting data at a 2 Mbps data rate to the user equipment. 